34 ideas
| 21752 | Prior to Gödel we thought truth in mathematics consisted in provability [Gödel, by Quine] |
| 7798 | There are three axiom schemas for propositional logic [Girle] |
| 7786 | Propositional logic handles negation, disjunction, conjunction; predicate logic adds quantifiers, predicates, relations [Girle] |
| 7799 | Proposition logic has definitions for its three operators: or, and, and identical [Girle] |
| 7797 | Axiom systems of logic contain axioms, inference rules, and definitions of proof and theorems [Girle] |
| 7794 | There are seven modalities in S4, each with its negation [Girle] |
| 7793 | ◊p → □◊p is the hallmark of S5 [Girle] |
| 7795 | S5 has just six modalities, and all strings can be reduced to those [Girle] |
| 7787 | Possible worlds logics use true-in-a-world rather than true [Girle] |
| 7796 | Modal logics were studied in terms of axioms, but now possible worlds semantics is added [Girle] |
| 7788 | Modal logic has four basic modal negation equivalences [Girle] |
| 17835 | Gödel show that the incompleteness of set theory was a necessity [Gödel, by Hallett,M] |
| 7789 | Necessary implication is called 'strict implication'; if successful, it is called 'entailment' [Girle] |
| 18946 | Unreflectively, we all assume there are nonexistents, and we can refer to them [Reimer] |
| 7790 | If an argument is invalid, a truth tree will indicate a counter-example [Girle] |
| 17886 | The limitations of axiomatisation were revealed by the incompleteness theorems [Gödel, by Koellner] |
| 10071 | Second Incompleteness: nice theories can't prove their own consistency [Gödel, by Smith,P] |
| 19123 | If soundness can't be proved internally, 'reflection principles' can be added to assert soundness [Gödel, by Halbach/Leigh] |
| 10621 | Gödel's First Theorem sabotages logicism, and the Second sabotages Hilbert's Programme [Smith,P on Gödel] |
| 17888 | The undecidable sentence can be decided at a 'higher' level in the system [Gödel] |
| 10132 | There can be no single consistent theory from which all mathematical truths can be derived [Gödel, by George/Velleman] |
| 10072 | First Incompleteness: arithmetic must always be incomplete [Gödel, by Smith,P] |
| 9590 | Arithmetical truth cannot be fully and formally derived from axioms and inference rules [Gödel, by Nagel/Newman] |
| 3198 | Gödel showed that arithmetic is either incomplete or inconsistent [Gödel, by Rey] |
| 11069 | Gödel's Second says that semantic consequence outruns provability [Gödel, by Hanna] |
| 10118 | First Incompleteness: a decent consistent system is syntactically incomplete [Gödel, by George/Velleman] |
| 10122 | Second Incompleteness: a decent consistent system can't prove its own consistency [Gödel, by George/Velleman] |
| 10611 | There is a sentence which a theory can show is true iff it is unprovable [Gödel, by Smith,P] |
| 10867 | 'This system can't prove this statement' makes it unprovable either way [Gödel, by Clegg] |
| 8747 | Realists are happy with impredicative definitions, which describe entities in terms of other existing entities [Gödel, by Shapiro] |
| 7800 | Analytic truths are divided into logically and conceptually necessary [Girle] |
| 7801 | Possibilities can be logical, theoretical, physical, economic or human [Girle] |
| 7792 | A world has 'access' to a world it generates, which is important in possible worlds semantics [Girle] |
| 3192 | Basic logic can be done by syntax, with no semantics [Gödel, by Rey] |